Pricing ad slots with consecutive multi-unit demand
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for Unit Demand Pricing Problems
For my final project I study the (nonparametric) unit demand pricing problem from a parametrized perspective. For instances with n items and m customers we give O(m) and O(n) algorithms respectively. We then investigate a price restricted variant of UDP called UDP-PS, and show the problem is fixed parameter tractable when the parameter is the number of customers.
متن کاملThe Unit-Demand Envy-Free Pricing Problem
We consider the unit-demand envy-free pricing problem, which is a unit-demand auction where each bidder receives an item that maximizes his utility, and the goal is to maximize the auctioneer’s profit. This problem is NP-hard and unlikely to be in APX. We present four new MIP formulations for it and experimentally compare them to a previous one due to Shioda, Tunçel, and Myklebust. We describe ...
متن کاملCompeting Mechanisms with Multi-Unit Consumer Demand
The competing mechanisms literature is extended to a market setting in which firms have fixed capacity, and there is a continuum of consumers who desire multiple units and can only purchase from one firm. Firms choose incentive compatible mechanisms in which consumers report their utility types; consumption of the good and payments of the numeraire are continuous functions of the reports. Unifo...
متن کاملEnvy-Free Pricing in Multi-unit Markets
We study the envy-free pricing problem in linear multi-unit markets with budgets, where there is a seller who brings multiple units of a good, while several buyers bring monetary endowments. Our goal is to compute an envy-free (item) price and allocation, i.e. an outcome where all the demands of the buyers are met given their budget constraints, which additionally achieves a desirable objective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2016
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-016-9335-7